Two Weight Bump Conditions for Matrix Weights
نویسندگان
چکیده
منابع مشابه
Matrix Pearson equations satisfied by Koornwinder weights in two variables
We consider Koornwinder’s method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder’s construction generates semiclassical orthogonal polynomials in two variables. We consider two methods for deducing matrix Pearson equations for weight functions associated with ...
متن کاملInverse Volume Inequalities for Matrix Weights
For weights in the matricial Muckenhoupt classes we investigate a number of properties analogous to properties which hold in the scalar Muckenhoupt classes. In contrast to the scalar case we exhibit for each p, 1 < p <∞, a matrix weight W ∈Ap,q \ ⋃ p′<pAp′,q′ . We also give a necessary and sufficient condition on W in Ap,q, a “reverse inverse volume inequality”, to ensure that W is inAp′,q′ for...
متن کاملThreshold for Positional Weight Matrix
weight matrix (PWM) is often used to search for putative transcription factor binding sites. A set of experimentally verified oligonucleotides known to be functional motifs are collected and aligned. The frequency of each nucleotide A, C, G, or T at each column of the alignment is calculated in the matrix. Once a PWM is constructed, it can be used to search from a nucleotide sequence for subseq...
متن کاملAre early first trimester weights valid proxies for preconception weight?
BACKGROUND An accurate estimate of preconception weight is necessary for providing a gestational weight gain range based on the Institute of Medicine's guidelines; however, an accurate and proximal preconception weight is not available for most women. We examined the validity of first trimester weights for estimating preconception body mass index category. METHODS Under identical measurement ...
متن کاملProduct distance matrix of a tree with matrix weights
Let T be a tree on n vertices and let the n− 1 edges e1, e2, . . . , en−1 have weights that are s× s matrices W1,W2, . . . ,Wn−1, respectively. For two vertices i, j, let the unique ordered path between i and j be pi,j = er1er2 . . . erk . Define the distance between i and j as the s × s matrix Ei,j = ∏k p=1Wep . Consider the ns × ns matrix D whose i, j-th block is the matrix Ei,j . We give a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integral Equations and Operator Theory
سال: 2018
ISSN: 0378-620X,1420-8989
DOI: 10.1007/s00020-018-2455-5